Decomposition of Boolean Function Sets for Boolean Neural Networks

نویسندگان

  • Roman Kohut
  • Bernd Steinbach
چکیده

This paper presents a new type of neuron, called Boolean neuron. We suggest algorithms for decomposition of Boolean functions sets based on Boolean neural networks that include only Boolean neurons. The advantages of these neural networks consist in the reduction of memory space and computation time in comparison to the representation of Boolean functions by usual neural networks. The Boolean neural network can be mapped to a FPGA so that our new approach substitutes classical design methods of these circuits. We show as example the AND-decomposition of a Boolean function set into unique basic functions and their mapping to the general Boolean neural network.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Propagation Models and Fitting Them for the Boolean Random Sets

In order to study the relationship between random Boolean sets and some explanatory variables, this paper introduces a Propagation model. This model can be applied when corresponding Poisson process of the Boolean model is related to explanatory variables and the random grains are not affected by these variables. An approximation for the likelihood is used to find pseudo-maximum likelihood esti...

متن کامل

Boolean Neural Networks

In this paper, we present a new type of neuron, called Boolean neuron. Further, we suggest the general structure of a neural network that includes only Boolean neurons and may realize several sets of Boolean functions. The advantages of these neural networks consist in the reduction of memory space and computation time in comparison to the representation of Boolean functions by usual neural net...

متن کامل

A Boolean Algebra Based Rule Extraction Algorithm for Neural Networks with Binary or Bipolar Inputs

Neural networks have been applied in various domain including science, commerce, medicine, and industry. However, The knowledge learned by a trained neural network is difficult to understand. This paper proposes a Boolean algebra based algorithm to extract comprehensible Boolean rules from supervised feed-forward neural networks to uncover the black-boxed knowledge. This algorithm is called the...

متن کامل

Neural Networks – A Model of Boolean Functions

This paper deals with the representation of Boolean functions using artificial neural networks and points out three important results. First, using a polynomial as transfer function, a single neuron is able to represent a non-monotonous Boolean function. Second, the number of inputs in the neural network can be decreased if the binary values of the Boolean variables are encoded. This approach s...

متن کامل

Rates of approximation of real-valued boolean functions by neural networks

We give upper bounds on rates of approximation of real-valued functions of d Boolean variables by one-hidden-layer perceptron networks. Our bounds are of the form c/n where c depends on certain norms of the function being approximated and n is the number of hidden units. We describe sets of functions where these norms grow either polynomially or exponentially with d.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004